Ambiguity and structural ambiguity of symmetric difference NFAs
نویسندگان
چکیده
منابع مشابه
Ambiguity and structural ambiguity of symmetric difference NFAs
Okhotin showed an exponential trade-off in the conversion from nondeterministic unary automata to unambiguous nondeterministic unary automata. We show that the trade-off in the case of unary symmetric difference automata to finitely (structurally) ambiguous unary symmetric difference automata is linear with constant 1 in the number of states. In particular, for every n-state unary nondeterminis...
متن کاملAmbiguity of Unary Symmetric Difference NFAs
Okhotin [9] showed an exponential trade-off in the conversion from nondeterministic unary finite automata to unambiguous nondeterministic unary finite automata. In this paper, we consider the trade-off in the case of unary symmetric difference finite automata to finitely ambiguous unary symmetric difference finite automata. Surprisingly, the trade-off is linear in the number of states of the fi...
متن کاملDescriptional Complexity of Ambiguity in Symmetric Difference NFAs
We investigate ambiguity for symmetric difference nondeterministic finite automata. We show the existence of unambiguous, finitely ambiguous, polynomially ambiguous and exponentially ambiguous symmetric difference nondeterministic finite automata. We show that, for each of these classes, there is a family of n-state nondeterministic finite automata such that the smallest equivalent deterministi...
متن کاملDescriptional Complexity of NFAs of Different Ambiguity
In this paper, we study the tradeoffs in descriptional complexity of NFA (nondeterministic finite automata) of various amounts of ambiguity. We say that two classes of NFA are separated if one class can be exponentially more succinct in descriptional sizes than the other. New results are given for separating DFA (deterministic finite automata) from UFA (unambiguous finite automata), UFA from MD...
متن کاملCounting Minimal Symmetric Difference NFAs
A result of Nicaud states that the number of distinct unary regular string languages recognized by minimal deterministic finite automata (DFAs) with n states is asymptotically equal to n2n−1. We consider the analogous question for symmetric difference automata (Z2NFAs), and show that precisely 22n−1 unary languages are recognized by n-state minimal Z2-NFAs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2014
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.04.019